Characteristic polynomial and eigenvalues of antiadjacency matrix of directed unicyclic flower vase graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adjacency matrix and characteristic polynomial of a derived voltage graph

In this article, we explain how to calculate the adjacency matrix and the characteristic polynomial of a derived voltage graph when the voltage group is abelian as presented in [1]. We then present a theorem for calculating the adjacency matrix of a derived voltage graph for any voltage group, abelian or non-abelian.

متن کامل

SIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

متن کامل

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

15 صفحه اول

On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph

The characteristic polynomial of the adjacency matrix of a graph is noted in connection with a quantity characterizing the topological nature of structural isomers saturated hydrocarbons [S], a set of numbers that are the same for all graphs isomorphic to the graph, and others [l]. Many properties of the characteristic polynomials of the adjacency matrices of a graph and its line graph [3] have...

متن کامل

Resistance matrix and q-Laplacian of a unicyclic graph

The resistance distance between two vertices of a graph can be defined as the effective resistance between the two vertices, when the graph is viewed as an electrical network with each edge carrying unit resistance. The concept has several different motivations. The resistance matrix of a graph is a matrix with its (i, j)-entry being the resistance distance between vertices i and j. We obtain a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2021

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/1722/1/012055